Towards Weak Bisimulation For Coalgebras
نویسندگان
چکیده
منابع مشابه
Towards Weak Bisimulation For Coalgebras
This report contains a novel approach to observation equivalence for coalgebras. We describe how to define weak homomorphisms, weak bisimulation, and investigate the connection between these notions as well as the relation to the known theory of bisimulation for coalgebras. The ultimate result of the paper is the correctness-proof for a weak coinduction proof principle.
متن کاملWeak Bisimulation for Action-Type Coalgebras
We propose a coalgebraic definition of weak bisimulation for a class of coalgebras obtained from bifunctors in Set. Weak bisimilarity for a system is obtained as strong bisimilarity of a transformed system. The transformation consists of two steps: First, the behaviour on actions is expanded to behaviour on finite words. Second, the behaviour on finite words is taken modulo the hiding of invisi...
متن کاملWeak bisimulation for coalgebras over order enriched monads
The paper introduces the notion of a weak bisimulation for coalgebras whose type is a monad satisfying some extra properties. In the first part of the paper we argue that systems with silent moves should be modelled coalgebraically as coalgebras whose type is a monad. We show that the visible and invisible part of the functor can be handled internally inside a monadic structure. In the second p...
متن کاملOn Path-Based Coalgebras and Weak Notions of Bisimulation
It is well known that the theory of coalgebras provides an abstract definition of behavioural equivalence that coincides with strong bisimulation across a wide variety of state-based systems. Unfortunately, the theory in the presence of so-called silent actions is not yet fully developed. In this paper, we give a coalgebraic characterisation of branching bisimulation in the context of labelled ...
متن کاملBisimulation Games on Coalgebras
The theory of coalgebras [9] knows several ways to define behavioural equivalence or bisimilarity [11]. Another, complementary, view is to characterize behavioural equivalence via a coalgebraic modal logic [10, 8]. In concurrency theory a third perspective is quite common, where behavioural equivalence is defined via attacker-defender games [12]. Such games are useful both for theoretical reaso...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2002
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80499-7